An FDP-Algorithm for Drawing Lattices
نویسنده
چکیده
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces forces acting on nodes and lines. A balanced state of the system will result in a diagram fulfilling the desired properties due to the underlying physical model. In our framework the aim was to maximize the conflict distance. In contrast to existing programs our approach provides attribute additive diagrams since forces act on V -irreducibles only. Another relevant aspect is a careful initialization that helps to minimize the number of edge crossings.
منابع مشابه
An Investigation on the Effects of Optimum Forming Parameters in Hydromechanical Deep Drawing Process Using the Genetic Algorithm
The present research work is concerned with the effects of optimum process variables in elevated temperature hydro-mechanical deep drawing of 5052 aluminum alloy. Punch-workpiece and die-workpiece friction coefficients together with the initial gap between the blank holder and matrix were considered as the process variables which, in optimization terminology, are called design parameters. Since...
متن کاملFamily Drawings before and after Treatment for Child Conduct Problems: Fluidity of Family Dysfunction
Children's drawings have previously been found to reflect their representations of family relationships. The present study examined whether evidence-based parent training for child conduct problems impacts on representations of family functioning using the Family Drawing Paradigm (FDP). N = 53 clinic-referred children (aged 3-15) with conduct problems and their families were assessed pre-treatm...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملAn equivalence functor between local vector lattices and vector lattices
We call a local vector lattice any vector lattice with a distinguished positive strong unit and having exactly one maximal ideal (its radical). We provide a short study of local vector lattices. In this regards, some characterizations of local vector lattices are given. For instance, we prove that a vector lattice with a distinguished strong unit is local if and only if it is clean with non no-...
متن کاملPlanarity of Additively Drawn Concept Lattices
In Formal Concept Analysis, it is a very important but quite difficult task to draw line diagrams of concept lattices automatically. In particular, we want every planar lattice to be visualized without edge crossings. Many algorithms ignore that fact or find plane diagrams only heuristically. We present a characterization of planar lattices based on the theorem of Baker, Fishburn and Roberts [1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007